Lower bounds for the mixed capacitated arc routing problem
نویسندگان
چکیده
Available online 30 June 2009
منابع مشابه
Flow-based formulations for the Mixed Capacitated Arc Routing Problem – Lower bounds
Mixed Capacitated Arc Routing Problem (MCARP) models arise in distribution or collecting problems where activities are performed by vehicles, with limited capacity, and are continuously distributed along some predefined links (routes, streets) of an associated network. Considering directed as well as undirected required links, it is a generalization of the well known Capacitated Arc Routing pro...
متن کاملNode Duplication Lower Bounds for the Capacitated Arc Routing Problem
It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.
متن کاملThe Capacitated Arc Routing Problem: Lower bounds
1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملImproved bounds for large scale capacitated arc routing problem
The Capacitated Arc Routing Problem (CARP) stands among the hardest combinatorial problems to solve or to find high quality solutions. This becomes even more true when dealing with large instances. This paper investigates methods to improve on lower and upper bounds of instances on graphs with over two hundred vertices and three hundred edges, dimensions that, today, can be considered of large ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & OR
دوره 37 شماره
صفحات -
تاریخ انتشار 2010